Syntactic transformation rules under P-Stable semantics: theory and implementation
نویسندگان
چکیده
منابع مشابه
Syntactic transformation rules under P-Stable semantics: theory and implementation
We study the simplification of normal logic programs under the P-Stable semantics, with respect to the notions of equivalence, using many of the transformation rules found in literature in the context of Answer Set Programming (ASP). A schema for the implementation of P-Stable semantics is provided using two well known open source tools: Lparse and Minisat. Also, a prototype written in Java of ...
متن کاملWeighted Rules under the Stable Model Semantics
We introduce the concept of weighted rules under the stable model semantics following the log-linear models of Markov Logic. This provides versatile methods to overcome the deterministic nature of the stable model semantics, such as resolving inconsistencies in answer set programs, ranking stable models, associating probability to stable models, and applying statistical inference to computing w...
متن کاملMarkov Logic Style Weighted Rules under the Stable Model Semantics
We introduce the language LP that extends logic programs under the stable model semantics to allow weighted rules similar to the way Markov Logic considers weighted formulas. LP is a proper extension of the stable model semantics to enable probabilistic reasoning, providing a way to handle inconsistency in answer set programming. We also show that the recently established logical relationship b...
متن کاملQuery Answering with Inconsistent Existential Rules under Stable Model Semantics
Traditional inconsistency-tolerent query answering in ontology-based data access relies on selecting maximal components of an ABox/database which are consistent with the ontology. However, some rules in ontologies might be unreliable if they are extracted from ontology learning or written by unskillful knowledge engineers. In this paper we present a framework of handling inconsistent existentia...
متن کاملImplementing the p-stable semantics
In this paper we review some theoretical results about the p-stable semantics, and based on that, we design some algorithms that search for the p-stable models of a normal program. An important point is that some of these algorithms can also be used to compute the stratified minimal models of a normal program.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTELIGENCIA ARTIFICIAL
سال: 2009
ISSN: 1988-3064
DOI: 10.4114/ia.v13i41.1028